Towards Improving Brandes' Algorithm for Betweenness Centrality

نویسندگان

  • Matthias Bentert
  • Alexander Dittmann
  • Leon Kellerhals
  • André Nichterlein
  • Rolf Niedermeier
چکیده

Betweenness centrality, measuring how many shortest paths pass through a vertex, is one of the most important network analysis concepts for assessing the (relative) importance of a vertex. The famous state-of-art algorithm of Brandes [2001] computes the betweenness centrality of all vertices in O(mn) worst-case time on an n-vertex and m-edge graph. In practical follow-up work, significant empirical speedups were achieved by preprocessing degreeone vertices. We extend this by showing how to also deal with degree-two vertices (turning out to be much richer in mathematical structure than the case of degree-one vertices). For our new betweenness centrality algorithm we prove the running time upper bound O(kn), where k is the size of a minimum feedback edge set of the input graph.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Divide-and-Conquer Algorithm for Betweenness Centrality

Given a graph G we define the betweenness centrality of a node v in V as the fraction of shortest paths between all node pairs in V that contain v. For this setting we describe Brandes++, a divide-and-conquer algorithm that can efficiently compute the exact values of betweenness scores. Brandes++ uses Brandes– the most widelyused algorithm for betweenness computation – as its subroutine. It ach...

متن کامل

On variants of shortest-path betweenness centrality and their generic computation

Betweenness centrality based on shortest paths is a standard measure of control utilized in numerous studies and implemented in all relevant software tools for network analysis. In this paper, a number of variants are reviewed, placed into context, and shown to be computable with simple variants of the algorithm commonly used for the standard case.

متن کامل

Better Approximation of Betweenness Centrality

Estimating the importance or centrality of the nodes in large networks has recently attracted increased interest. Betweenness is one of the most important centrality indices, which basically counts the number of shortest paths going through a node. Betweenness has been used in diverse applications, e.g., social network analysis or route planning. Since exact computation is prohibitive for large...

متن کامل

A Faster Algorithm for Betweenness Centrality

The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require Θ(n) time and Θ(n) space, where n is the number of actors in the network. Motivated by the fast-growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They re...

متن کامل

Betweenness Centrality - Incremental and Faster

We present an incremental algorithm that updates the betweenness centrality (BC) score of all vertices in a graph G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O(ν∗ · n) time, where ν∗ is bounded by m∗, the number of edges that lie on a shortest path in G. We achieve the same bound for the more general incremental vertex update ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1802.06701  شماره 

صفحات  -

تاریخ انتشار 2018